Centerscope

Centerscope, formerly Scope, was published by the Boston University Medical Center "to communicate the concern of the Medical Center for the development and maintenance of improved health care in contemporary society.

Thickness of skeletons of arithmetic hyperbolic orbifolds

We show that closed arithmetic hyperbolic n-dimensional orbifolds with largerand larger volumes give rise to triangulations of the underlying spaces whose1-skeletons are harder and harder to embed nicely in Euclidean space. To showthis we generalize an inequality of Gromov and Guth to hyperbolic n-orbifoldsand find nearly optimal geodesic triangulations of arithmetic hyperbolicn-orbifolds.<br

Technical Note: Novel method for water vapor monitoring using wireless communication networks measurements

International audienceWe propose a new technique that overcomes the obstacles of the existing methods for monitoring near-surface water vapor, by estimating humidity from data collected through existing wireless communication networks. Weather conditions and atmospheric phenomena affect the electromagnetic channel, causing attenuations to the radio signals. Thus, wireless communication networks are in effect built-in environmental monitoring facilities. The wireless microwave links, used in these networks, are widely deployed by cellular providers for backhaul communication between base stations, a few tens of meters above ground level. As a result, the proposed method can provide moisture observations at high temporal and spatial resolution. Further, the implementation cost is minimal, since the data used are already collected and saved by the cellular operators. In addition ? many of these links are installed in areas where access is difficult such as orographic terrain and complex topography. As such, our method enables measurements in places that have been hard to measure in the past, or have never been measured before. We present results from real-data measurements taken from two microwave links used in a backhaul cellular network that show excellent correlation to surface station humidity measurements. The measurements were taken daily in two sites, one in northern Israel (28 measurements), the other in central Israel (29 measurements).The correlation of the microwave link measurements to those of the humidity gauges were 0.9 and 0.82 for the north and central sites, respectively. The RMSE were 20.8% and 33.1% for the northern and central site measurements, respectively

Prediction of rainfall intensity measurement errors using commercial microwave communication links

Commercial microwave radio links forming cellular communication networks are known to be a valuable instrument for measuring near-surface rainfall. However, operational communication links are more uncertain relatively to the dedicated installations since their geometry and frequencies are optimized for high communication performance rather than observing rainfall. Quantification of the uncertainties for measurements that are non-optimal in the first place is essential to assure usability of the data. &lt;br&gt;&lt;br&gt; In this work we address modeling of instrumental impairments, i.e. signal variability due to antenna wetting, baseline attenuation uncertainty and digital quantization, as well as environmental ones, i.e. variability of drop size distribution along a link affecting accuracy of path-averaged rainfall measurement and spatial variability of rainfall in the link's neighborhood affecting the accuracy of rainfall estimation out of the link path. Expressions for root mean squared error (RMSE) for estimates of path-averaged and point rainfall have been derived. To verify the RMSE expressions quantitatively, path-averaged measurements from 21 operational communication links in 12 different locations have been compared to records of five nearby rain gauges over three rainstorm events. &lt;br&gt;&lt;br&gt; The experiments show that the prediction accuracy is above 90% for temporal accumulation less than 30 min and lowers for longer accumulation intervals. Spatial variability in the vicinity of the link, baseline attenuation uncertainty and, possibly, suboptimality of wet antenna attenuation model are the major sources of link-gauge discrepancies. In addition, the dependence of the optimal coefficients of a conventional wet antenna attenuation model on spatial rainfall variability and, accordingly, link length has been shown. &lt;br&gt;&lt;br&gt; The expressions for RMSE of the path-averaged rainfall estimates can be useful for integration of measurements from multiple heterogeneous links into data assimilation algorithms

Obstacle Numbers of Planar Graphs

Given finitely many connected polygonal obstacles $O_1,\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\em visibility graph} of $P$ with obstacles $O_1,\dots,O_k$ is the (geometric) graph with vertex set $P$, where two vertices are adjacent if the straight line segment joining them intersects no obstacle. The obstacle number of a graph $G$ is the smallest integer $k$ such that $G$ is the visibility graph of a set of points with $k$ obstacles. If $G$ is planar, we define the planar obstacle number of $G$ by further requiring that the visibility graph has no crossing edges (hence that it is a planar geometric drawing of $G$). In this paper, we prove that the maximum planar obstacle number of a planar graph of order $n$ is $n-3$, the maximum being attained (in particular) by maximal bipartite planar graphs. This displays a significant difference with the standard obstacle number, as we prove that the obstacle number of every bipartite planar graph (and more generally in the class PURE-2-DIR of intersection graphs of straight line segments in two directions) of order at least $3$ is $1$.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Giving patients granular control of personal health information: Using an ethics ‘Points to Consider’ to inform informatics system designers

Objective: There are benefits and risks of giving patients more granular control of their personal health information in electronic health record (EHR) systems. When designing EHR systems and policies, informaticists and system developers must balance these benefits and risks. Ethical considerations should be an explicit part of this balancing. Our objective was to develop a structured ethics framework to accomplish this. Methods: We reviewed existing literature on the ethical and policy issues, developed an ethics framework called a “Points to Consider” (P2C) document, and convened a national expert panel to review and critique the P2C. Results: We developed the P2C to aid informaticists designing an advanced query tool for an electronic health record (EHR) system in Indianapolis. The P2C consists of six questions (“Points”) that frame important ethical issues, apply accepted principles of bioethics and Fair Information Practices, comment on how questions might be answered, and address implications for patient care. Discussion: The P2C is intended to clarify whatis at stake when designers try to accommodate potentially competing ethical commitments and logistical realities. The P2C was developed to guide informaticists who were designing a query tool in an existing EHR that would permit patient granular control. While consideration of ethical issues is coming to the forefront of medical informatics design and development practices, more reflection is needed to facilitate optimal collaboration between designers and ethicists. This report contributes to that discussion

Grid-Obstacle Representations with Connections to Staircase Guarding

In this paper, we study grid-obstacle representations of graphs where we assign grid-points to vertices and define obstacles such that an edge exists if and only if an $xy$-monotone grid path connects the two endpoints without hitting an obstacle or another vertex. It was previously argued that all planar graphs have a grid-obstacle representation in 2D, and all graphs have a grid-obstacle representation in 3D. In this paper, we show that such constructions are possible with significantly smaller grid-size than previously achieved. Then we study the variant where vertices are not blocking, and show that then grid-obstacle representations exist for bipartite graphs. The latter has applications in so-called staircase guarding of orthogonal polygons; using our grid-obstacle representations, we show that staircase guarding is \textsc{NP}-hard in 2D.Comment: To appear in the proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

On the Maximum Crossing Number

Research about crossings is typically about minimization. In this paper, we consider \emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured that any graph has a \emph{convex} straight-line drawing, e.g., a drawing with vertices in convex position, that maximizes the number of edge crossings. We disprove this conjecture by constructing a planar graph on twelve vertices that allows a non-convex drawing with more crossings than any convex one. Bald et al. [Proc. COCOON, 2016] showed that it is NP-hard to compute the maximum number of crossings of a geometric graph and that the weighted geometric case is NP-hard to approximate. We strengthen these results by showing hardness of approximation even for the unweighted geometric case and prove that the unweighted topological case is NP-hard.Comment: 16 pages, 5 figure